0.03/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.11 % Command : run_E %s %d THM 0.10/0.31 % Computer : n018.cluster.edu 0.10/0.31 % Model : x86_64 x86_64 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.31 % Memory : 8042.1875MB 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.10/0.31 % CPULimit : 1440 0.10/0.31 % WCLimit : 180 0.10/0.31 % DateTime : Thu Jul 4 06:55:38 EDT 2024 0.10/0.32 % CPUTime : 0.17/0.44 Running higher-order theorem proving 0.17/0.45 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.Olhq93JYI2/E---3.1_23489.p 2.21/0.82 # Version: 3.2.0-ho 2.21/0.82 # Preprocessing class: HSMSSMSSSSSNHHA. 2.21/0.82 # Scheduled 6 strats onto 8 cores with 180 seconds (1440 total) 2.21/0.82 # Starting full_lambda_6 with 540s (3) cores 2.21/0.82 # Starting post_as_ho1 with 180s (1) cores 2.21/0.82 # Starting lpo6_lambda_fix with 180s (1) cores 2.21/0.82 # Starting ho_unfolding_1 with 180s (1) cores 2.21/0.82 # Starting new_ho_10_unif with 180s (1) cores 2.21/0.82 # Starting ho_unfolding_2 with 180s (1) cores 2.21/0.82 # ho_unfolding_1 with pid 23570 completed with status 0 2.21/0.82 # Result found by ho_unfolding_1 2.21/0.82 # Preprocessing class: HSMSSMSSSSSNHHA. 2.21/0.82 # Scheduled 6 strats onto 8 cores with 180 seconds (1440 total) 2.21/0.82 # Starting full_lambda_6 with 540s (3) cores 2.21/0.82 # Starting post_as_ho1 with 180s (1) cores 2.21/0.82 # Starting lpo6_lambda_fix with 180s (1) cores 2.21/0.82 # Starting ho_unfolding_1 with 180s (1) cores 2.21/0.82 # No SInE strategy applied 2.21/0.82 # Search class: HGUNF-FFSF00-SHHFFMBN 2.21/0.82 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 2.21/0.82 # Starting ehoh_best6_lambda with 98s (1) cores 2.21/0.82 # ehoh_best6_lambda with pid 23577 completed with status 0 2.21/0.82 # Result found by ehoh_best6_lambda 2.21/0.82 # Preprocessing class: HSMSSMSSSSSNHHA. 2.21/0.82 # Scheduled 6 strats onto 8 cores with 180 seconds (1440 total) 2.21/0.82 # Starting full_lambda_6 with 540s (3) cores 2.21/0.82 # Starting post_as_ho1 with 180s (1) cores 2.21/0.82 # Starting lpo6_lambda_fix with 180s (1) cores 2.21/0.82 # Starting ho_unfolding_1 with 180s (1) cores 2.21/0.82 # No SInE strategy applied 2.21/0.82 # Search class: HGUNF-FFSF00-SHHFFMBN 2.21/0.82 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 2.21/0.82 # Starting ehoh_best6_lambda with 98s (1) cores 2.21/0.82 # Preprocessing time : 0.001 s 2.21/0.82 # Presaturation interreduction done 2.21/0.82 2.21/0.82 # Proof found! 2.21/0.82 # SZS status Theorem 2.21/0.82 # SZS output start CNFRefutation 2.21/0.82 thf(decl_22, type, epred1_0: ($o > $o) > ($o > $o) > $o). 2.21/0.82 thf(decl_23, type, epred2_0: ($o > $o) > $o). 2.21/0.82 thf(ramsey_u_2_4_4, conjecture, ![X1:($o > $o) > ($o > $o) > $o]:((![X2:$o > $o, X3:$o > $o]:(((X1 @ X3 @ X2)<=(X1 @ X2 @ X3)))=>(?[X4:$o > $o, X5:$o > $o, X6:($o > $o) > $o]:((((X6 @ X4)&~((X6 @ X5)))&(X1 @ X5 @ X4)))|?[X4:$o > $o, X5:$o > $o, X7:$o > $o, X8:$o > $o, X6:($o > $o) > $o, X9:($o > $o) > $o, X10:($o > $o) > $o]:(((((((((((((((((((X6 @ X4)&~((X6 @ X7)))&~((X6 @ X8)))&~((X9 @ X7)))&~((X10 @ X5)))&(X10 @ X7))&~((X1 @ X5 @ X4)))&~((X1 @ X8 @ X4)))&~((X1 @ X8 @ X7)))&~((X1 @ X8 @ X5)))&~((X1 @ X7 @ X5)))&~((X1 @ X7 @ X4)))&~((X10 @ X8)))&~((X10 @ X4)))&~((X9 @ X8)))&(X9 @ X5))&~((X9 @ X4)))&~((X6 @ X5))))))), file('/export/starexec/sandbox/tmp/tmp.Olhq93JYI2/E---3.1_23489.p', ramsey_u_2_4_4)). 2.21/0.82 thf(c_0_1, negated_conjecture, ~(![X1:($o > $o) > ($o > $o) > $o]:((![X2:$o > $o, X3:$o > $o]:(((X1 @ X2 @ X3)=>(X1 @ X3 @ X2)))=>(?[X4:$o > $o, X5:$o > $o, X6:($o > $o) > $o]:((((X6 @ X4)&~((X6 @ X5)))&(X1 @ X5 @ X4)))|?[X4:$o > $o, X5:$o > $o, X7:$o > $o, X8:$o > $o, X6:($o > $o) > $o, X9:($o > $o) > $o, X10:($o > $o) > $o]:(((((((((((((((((((X6 @ X4)&~((X6 @ X7)))&~((X6 @ X8)))&~((X9 @ X7)))&~((X10 @ X5)))&(X10 @ X7))&~((X1 @ X5 @ X4)))&~((X1 @ X8 @ X4)))&~((X1 @ X8 @ X7)))&~((X1 @ X8 @ X5)))&~((X1 @ X7 @ X5)))&~((X1 @ X7 @ X4)))&~((X10 @ X8)))&~((X10 @ X4)))&~((X9 @ X8)))&(X9 @ X5))&~((X9 @ X4)))&~((X6 @ X5)))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[ramsey_u_2_4_4])])). 2.21/0.82 thf(c_0_2, negated_conjecture, ![X25:$o > $o, X26:$o > $o, X27:$o > $o, X28:$o > $o, X29:($o > $o) > $o, X30:$o > $o, X31:$o > $o, X32:$o > $o, X33:$o > $o, X34:($o > $o) > $o, X35:($o > $o) > $o, X36:($o > $o) > $o]:(((~(epred1_0 @ X25 @ X26)|(epred1_0 @ X26 @ X25))&((~(X29 @ X27)|(X29 @ X28)|~(epred1_0 @ X28 @ X27))&(~(X34 @ X30)|(X34 @ X32)|(X34 @ X33)|(X35 @ X32)|(X36 @ X31)|~(X36 @ X32)|(epred1_0 @ X31 @ X30)|(epred1_0 @ X33 @ X30)|(epred1_0 @ X33 @ X32)|(epred1_0 @ X33 @ X31)|(epred1_0 @ X32 @ X31)|(epred1_0 @ X32 @ X30)|(X36 @ X33)|(X36 @ X30)|(X35 @ X33)|~(X35 @ X31)|(X35 @ X30)|(X34 @ X31))))), inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])). 2.21/0.82 thf(c_0_3, negated_conjecture, ![X2:$o > $o, X4:$o > $o, X3:$o > $o, X6:($o > $o) > $o, X10:($o > $o) > $o, X9:($o > $o) > $o, X5:$o > $o]:(((X6 @ X3)|(X6 @ X4)|(X9 @ X3)|(X10 @ X5)|(epred1_0 @ X5 @ X2)|(epred1_0 @ X4 @ X2)|(epred1_0 @ X4 @ X3)|(epred1_0 @ X4 @ X5)|(epred1_0 @ X3 @ X5)|(epred1_0 @ X3 @ X2)|(X10 @ X4)|(X10 @ X2)|(X9 @ X4)|(X9 @ X2)|(X6 @ X5)|~((X6 @ X2))|~((X10 @ X3))|~((X9 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_2])). 2.21/0.82 thf(c_0_4, negated_conjecture, ![X6:($o > $o) > $o, X3:$o > $o, X2:$o > $o]:(((X6 @ X3)|~((X6 @ X2))|~((epred1_0 @ X3 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_2])). 2.21/0.82 thf(c_0_5, plain, ![X37:$o > $o, X38:$o]:(((X37 @ ((epred2_0 @ X37)))|~((X37 @ ((X38)))))), inference(introduce_choice_axiom,[status(thm)],[])). 2.21/0.82 thf(c_0_6, negated_conjecture, ![X2:$o > $o, X3:$o > $o, X4:$o > $o, X10:($o > $o) > $o, X9:($o > $o) > $o, X6:($o > $o) > $o, X5:$o > $o]:(((X6 @ X2)|(X6 @ X3)|(X6 @ X4)|(X9 @ X5)|(X9 @ X2)|(X9 @ X3)|(X10 @ X5)|(X10 @ X3)|(X10 @ X4)|~((X10 @ X2))|~((X9 @ X4))|~((X6 @ X5)))), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_3, c_0_4]), c_0_4]), c_0_4]), c_0_4]), c_0_4]), c_0_4])). 2.21/0.82 thf(c_0_7, negated_conjecture, ![X2:$o > $o, X38:$o]:(((X2 @ ((epred2_0 @ X2)))|~((X2 @ ((X38)))))), inference(choice_inst,[status(thm)],[c_0_4, c_0_5])). 2.21/0.82 thf(c_0_8, negated_conjecture, ![X4:$o > $o, X3:$o > $o, X9:($o > $o) > $o, X6:($o > $o) > $o, X5:$o > $o, X2:$o > $o]:((((X2)=(X3))|((X4)=(X3))|((X5)=(X3))|(X6 @ X3)|(X6 @ X4)|(X6 @ X5)|(X9 @ X2)|(X9 @ X3)|(X9 @ X4)|~((X9 @ X5))|~((X6 @ X2)))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_6])). 2.21/0.82 thf(c_0_9, negated_conjecture, ![X38:$o]:(((epred2_0 @ (^[Z0/* 3 */:$o]:((((Z0))=((X38))))))<=>(X38))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_7])). 2.21/0.82 thf(c_0_10, negated_conjecture, ![X2:$o > $o, X3:$o > $o, X6:($o > $o) > $o, X5:$o > $o, X4:$o > $o]:((((X2)=(X3))|((X4)=(X3))|((X3)=(X5))|((X2)=(X5))|((X4)=(X5))|(X6 @ X3)|(X6 @ X2)|(X6 @ X5)|~((X6 @ X4)))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]), c_0_8])). 2.21/0.82 thf(c_0_11, negated_conjecture, ~((epred2_0 @ (^[Z0/* 7 */:$o]:(~((Z0)))))), inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_9])])). 2.21/0.82 thf(c_0_12, negated_conjecture, ![X3:$o > $o, X2:$o > $o, X4:$o > $o, X5:$o > $o]:((((X2)=(X3))|((X3)=(X4))|((X2)=(X4))|((X5)=(X4))|((X3)=(X5))|((X2)=(X5)))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]), c_0_10])). 2.21/0.82 thf(c_0_13, negated_conjecture, ![X2:$o > $o, X3:$o > $o, X4:$o > $o]:((((X2)=($not))|(($not)=(X3))|((X4)=(X3))|((X2)=(X3))|((X4)=(X2))|~((epred2_0 @ X4)))), inference(spm,[status(thm)],[c_0_11, c_0_12])). 2.21/0.82 thf(c_0_14, negated_conjecture, ![X2:$o > $o, X3:$o > $o, X469:$o, X4:$o > $o]:((((X2 @ ((X469)))<=>~((X469)))|(($not)=(X3))|((X4)=(X2))|((X2)=(X3))|((X4)=(X3))|~((epred2_0 @ X4)))), inference(arg_cong,[status(thm)],[c_0_13])). 2.21/0.82 thf(c_0_15, negated_conjecture, ![X2:$o > $o, X4:$o > $o, X3:$o > $o]:(((($not)=(X2))|((X3)=(X2))|((X4)=(X2))|((X3)=(X4))|(X4 @ (~($true)))|~((epred2_0 @ X3)))), inference(dynamic_cnf,[status(thm)],[c_0_14])). 2.21/0.82 thf(c_0_16, negated_conjecture, (epred2_0 @ (^[Z0/* 3 */:$o]:((Z0)))), inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_9])])). 2.21/0.82 thf(c_0_17, negated_conjecture, ![X3:$o > $o, X2:$o > $o]:((((^[Z0/* 3 */:$o]:((Z0)))=(X2))|((^[Z0/* 3 */:$o]:((Z0)))=(X3))|(($not)=(X3))|((X2)=(X3))|(X2 @ (~($true))))), inference(spm,[status(thm)],[c_0_15, c_0_16])). 2.21/0.82 thf(c_0_18, negated_conjecture, ![X1039:$o, X3:$o > $o, X2:$o > $o]:(((($not)=(X3))|((^[Z0/* 3 */:$o]:((Z0)))=(X3))|((X1039)<=>(X2 @ ((X1039))))|((X2)=(X3))|(X2 @ (~($true))))), inference(arg_cong,[status(thm)],[c_0_17])). 2.21/0.82 thf(c_0_19, negated_conjecture, ![X2:$o > $o, X3:$o > $o]:((((^[Z0/* 3 */:$o]:((Z0)))=(X2))|(($not)=(X2))|((X3)=(X2))|(X3 @ (~($true)))|(X3 @ (($true))))), inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_18])])). 2.21/0.82 thf(c_0_20, negated_conjecture, ![X2:$o > $o, X3:$o > $o]:(((($not)=(X2))|((^[Z0/* 3 */:$o]:((Z0)))=(X2))|((X3)=(X2))|(X3 @ ((epred2_0 @ X3))))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7, c_0_19]), c_0_7])). 2.21/0.82 thf(c_0_21, negated_conjecture, ![X2:$o > $o, X1589:$o, X3:$o > $o]:(((($not)=(X2))|((X1589)<=>(X2 @ ((X1589))))|((X3)=(X2))|(X3 @ ((epred2_0 @ X3))))), inference(arg_cong,[status(thm)],[c_0_20])). 2.21/0.82 thf(c_0_22, negated_conjecture, ![X3:$o > $o, X2:$o > $o]:(((($not)=(X2))|((X3)=(X2))|(X3 @ ((epred2_0 @ X3)))|~((X2 @ (~($true)))))), inference(dynamic_cnf,[status(thm)],[c_0_21])). 2.21/0.82 thf(c_0_23, negated_conjecture, ![X1607:$o, X3:$o > $o, X2:$o > $o]:(((~((X1607))<=>(X2 @ ((X1607))))|((X3)=(X2))|(X3 @ ((epred2_0 @ X3)))|~((X2 @ (~($true)))))), inference(arg_cong,[status(thm)],[c_0_22])). 2.21/0.82 thf(c_0_24, negated_conjecture, ![X2:$o > $o, X3:$o > $o]:((((X2)=(X3))|(X2 @ ((epred2_0 @ X2)))|~((X3 @ (($true))))|~((X3 @ (~($true)))))), inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_23])])). 2.21/0.82 thf(c_0_25, negated_conjecture, ![X2:$o > $o, X1644:$o, X3:$o > $o]:((((X2 @ ((X1644)))<=>(X3 @ ((X1644))))|(X2 @ ((epred2_0 @ X2)))|~((X3 @ (($true))))|~((X3 @ (~($true)))))), inference(arg_cong,[status(thm)],[c_0_24])). 2.21/0.82 thf(c_0_26, negated_conjecture, ($false), inference(flex_resolve,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_25])])]), ['proof']). 2.21/0.82 # SZS output end CNFRefutation 2.21/0.82 # Parsed axioms : 1 2.21/0.82 # Removed by relevancy pruning/SinE : 0 2.21/0.82 # Initial clauses : 3 2.21/0.82 # Removed in clause preprocessing : 0 2.21/0.82 # Initial clauses in saturation : 3 2.21/0.82 # Processed clauses : 769 2.21/0.82 # ...of these trivial : 19 2.21/0.82 # ...subsumed : 196 2.21/0.82 # ...remaining for further processing : 553 2.21/0.82 # Other redundant clauses eliminated : 1592 2.21/0.82 # Clauses deleted for lack of memory : 0 2.21/0.82 # Backward-subsumed : 74 2.21/0.82 # Backward-rewritten : 0 2.21/0.82 # Generated clauses : 11835 2.21/0.82 # ...of the previous two non-redundant : 4367 2.21/0.82 # ...aggressively subsumed : 0 2.21/0.82 # Contextual simplify-reflections : 16 2.21/0.82 # Paramodulations : 8654 2.21/0.82 # Factorizations : 463 2.21/0.82 # NegExts : 115 2.21/0.82 # Equation resolutions : 1592 2.21/0.82 # Disequality decompositions : 0 2.21/0.82 # Total rewrite steps : 2938 2.21/0.82 # ...of those cached : 2937 2.21/0.82 # Propositional unsat checks : 0 2.21/0.82 # Propositional check models : 0 2.21/0.82 # Propositional check unsatisfiable : 0 2.21/0.82 # Propositional clauses : 0 2.21/0.82 # Propositional clauses after purity: 0 2.21/0.82 # Propositional unsat core size : 0 2.21/0.82 # Propositional preprocessing time : 0.000 2.21/0.82 # Propositional encoding time : 0.000 2.21/0.82 # Propositional solver time : 0.000 2.21/0.82 # Success case prop preproc time : 0.000 2.21/0.82 # Success case prop encoding time : 0.000 2.21/0.82 # Success case prop solver time : 0.000 2.21/0.82 # Current number of processed clauses : 156 2.21/0.82 # Positive orientable unit clauses : 2 2.21/0.82 # Positive unorientable unit clauses: 0 2.21/0.82 # Negative unit clauses : 1 2.21/0.82 # Non-unit-clauses : 153 2.21/0.82 # Current number of unprocessed clauses: 3601 2.21/0.82 # ...number of literals in the above : 30557 2.21/0.82 # Current number of archived formulas : 0 2.21/0.82 # Current number of archived clauses : 398 2.21/0.82 # Clause-clause subsumption calls (NU) : 9630 2.21/0.82 # Rec. Clause-clause subsumption calls : 1147 2.21/0.82 # Non-unit clause-clause subsumptions : 285 2.21/0.82 # Unit Clause-clause subsumption calls : 7 2.21/0.82 # Rewrite failures with RHS unbound : 0 2.21/0.82 # BW rewrite match attempts : 1 2.21/0.82 # BW rewrite match successes : 1 2.21/0.82 # Condensation attempts : 0 2.21/0.82 # Condensation successes : 0 2.21/0.82 # Termbank termtop insertions : 452686 2.21/0.82 # Search garbage collected termcells : 432 2.21/0.82 2.21/0.82 # ------------------------------------------------- 2.21/0.82 # User time : 0.358 s 2.21/0.82 # System time : 0.008 s 2.21/0.82 # Total time : 0.366 s 2.21/0.82 # Maximum resident set size: 1744 pages 2.21/0.82 2.21/0.82 # ------------------------------------------------- 2.21/0.82 # User time : 0.358 s 2.21/0.82 # System time : 0.011 s 2.21/0.82 # Total time : 0.369 s 2.21/0.82 # Maximum resident set size: 1720 pages 2.21/0.82 % E---3.1 exiting 2.21/0.83 % E exiting 2.21/0.83 EOF